A New Algorithm for 2–layer Manhattan Channel Routing
نویسنده
چکیده
Channel routing in the 2–layer Manhattan model is one of the most investigated problems in detailed routing. Finding a minimum width solution was proved to be NP–hard by Szymanski [8]. In this paper we give a complete characterization of all specifications that are solvable if the width can be arbitrarily large, but the length of the channel cannot be extended by introducing extra columns. Furthermore, we present a linear time algorithm to solve these specifications with a width at most constant times the length of the problem.
منابع مشابه
A Re-router for Reducing Wire Length in Multi-Layer No-Dogleg Channel Routing
The minimization of total wire length is one of the most key issue in VLSI physical design automation, as it reduces the cost of physical wiring required along with the electrical hazards of having long wires in the interconnection, power consumption, and signal propagation delay. So, it is still important as cost as well as high performance issue. The problem of reduced wire length routing sol...
متن کاملThe Star-Routing Algorithm Based on Manhattan-Diagonal Model for Three Layers Channel Routing
In this paper, we employ gridded model for channel routing and place the terminals which are horizontally aligned. We have developed a two-layer channel router that can eliminate the constraints due to overlap. The proposed approach is suitable for cell/IP-based channel-less circuit with a few channels. Our developed tool can route the nets in nearly linear time achieving to the advantage of ti...
متن کاملAlgorithms for Reducing Crosstalk in Two-Layer Channel Routing
Crosstalk minimization is one of the most important high performance aspects in interconnecting VLSI circuits. With advancement of fabrication technology, devices and interconnecting wires are placed in closer proximity and circuits operate at higher frequencies. This results in crosstalk between wire segments. Crosstalk minimization problem for the reserved two-layer Manhattan channel routing ...
متن کاملA general greedy channel routing algorithm
Abstmt-This paper presents a new channel routing algorithm which assigns wires track by track in a greedy way. The simple underlying data structures and strategy used in this algorithm can be generalized to obtain a class of heuristic channel routing algorithms. The proposed new algorithm has a backtracking capability to increase the chance of completing the routing with a minimum number of tra...
متن کاملImproving Size-bounds for Subcases of Square-shaped Switchbox Routing1
Various problems are studied in the field of detailed VLSI routing. According to the position of the terminals on the outer boundaries of a rectangular grid, one can distinguish between different subcases of Switchbox Routing: C-shaped, Gamma, Channel and Single Row Routing. This paper focuses on the minimum number of layers needed for solving these problems either in the Manhattan, or in the u...
متن کامل